Searching for optimal positions through directional data in a political competition model
نویسندگان
چکیده
منابع مشابه
Searching for equilibrium positions in a game of political competition with restrictions
This paper considers a problem of political economy in which a Nash equilibrium study is performed in a proposed game with restrictions where the two major parties in a country vary their position within a politically flexible framework to increase their number of voters. The model as presented fits the reality of many countries. Moreover, it avoids the uniqueness of equilibrium positions. The ...
متن کاملSearching Political Data by Strategy
Professional search could benefit significantly from advanced information retrieval techniques. However, current search systems fail in the matching between the conceptual level of the professional information needs and the data processing level of the available search technologies. Search by strategy is a novel paradigm that puts the modelling phase of complex search paths at a central spot. W...
متن کاملAn Optimal Model for Medicine Preparation Using Data Mining
Introduction: Lack of financial resources and liquidity are the main problems of hospitals. Pharmacies are one of the sectors that affect the turnover of hospitals and due to lack of forecast for the use and supply of medicines, at the end of the year, encounter over-inventory, large volumes of expired medicines, and sometimes shortage of medicines. Therefore, medicine prediction using availabl...
متن کاملAn Optimal Model for Medicine Preparation Using Data Mining
Introduction: Lack of financial resources and liquidity are the main problems of hospitals. Pharmacies are one of the sectors that affect the turnover of hospitals and due to lack of forecast for the use and supply of medicines, at the end of the year, encounter over-inventory, large volumes of expired medicines, and sometimes shortage of medicines. Therefore, medicine prediction using availabl...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Operational Research
سال: 2018
ISSN: 1745-7645,1745-7653
DOI: 10.1504/ijor.2018.094234